A Heuristic Approach to Grouping and Timetabling of Project Presentations of Student Teams
نویسندگان
چکیده
A key requirement of the Introduction to Management course at Sabancı University, is the preparation of a business plan. About 40 teams present their business plans. Teams present in groups of 3 or 4, and all members of the teams in a group are required to be in the audience when other teams of their group present. Teams of judges used for different groups may change. MGMT 201 is taken students from different colleges and classes (sophomore, junior, etc). Three key goals defined the need for the current work. Firstly, as judges inevitably grade presentations relative to each other, we would like to have each group of teams to reflect the academic diversity (college, GPA, class) present in the course. The second goal is to have teams with the same type of business plans (e.g. retail, manufacturing, or services) assigned to the same group. The third goal is related to the timing of the presentations. It is not desirable to schedule all the presentations after 6:30 PM when students do not have any classes. This creates a timetabling problem where only certain day time–slots are feasible for certain teams.
منابع مشابه
A discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملHeuristic Faculty Course Timetabling with Student Sectioning
This paper studies a real faculty course timetabling problem of Faculty of Computer Science and Information Technology (FCSIT), Universiti Malaysia Sarawak (UNIMAS). FCSIT offers 5 four-year programmes. Each programme has own set of courses but some courses are required by more than one programme. List of courses for each semester of all programmes are planned and suggested by faculty as in cou...
متن کاملGenerating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملUsing fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملA Simulated Annealing Hyper-heuristic for University Course Timetabling
The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...
متن کامل